Q.142 In ______, the difference between the height of the left sub tree and height of the right

tree, for each node, is almost one.

(A) Binary search tree (B) AVL - tree

(C) Complete tree (D) Threaded binary tree

Q.139 A full binary tree with 'n' non-leaf nodes contains

(A) log2 n nodes . (B) n+1 nodes.

(C) 2n nodes. (D) 2n+l nodes.

Q.135 The search technique for searching a sorted file that requires increased amount of space is

(A) indexed sequential search (B) interpolation search

(C) sequential search (D) tree search

Q.134 The sorting technique where array to be sorted is partitioned again and again in such a

way that all elements less than or equal to partitioning element appear before it and

those which are greater appear after it, is called

(A) merge sort (B) quick sort

(C) selection sort (D) none of these

Q.133 Linked lists are not suitable data structures for which one of the following problems

(A) insertion sort (B) binary search

(C) radix sort (D) polynomial manipulation

Q.132 Overflow condition in linked list may occur when attempting to_____

(A) Create a node when free space pool is empty.

(B) Traverse the nodes when free space pool is empty.

(C) Create a node when linked list is empty.

(D) None of these.

Q.131 Which of the following types of expressions do not require precedence rules for

evaluation?

(A) fully parenthesised infix expression

(B) postfix expression

(C) partially parenthesised infix expression

(D) more than one of the above